Restarting Automata with Auxiliary Symbols and Small Lookahead
نویسنده
چکیده
We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective (left-) monotone restarting automaton models characterise the context-free languages and that the respective right-left-monotone restarting automata characterise the linear languages both with just lookahead length 2.
منابع مشابه
Restarting automata with restricted utilization of auxiliary symbols
The restarting automaton is a restricted model of computation that was introduced by Jančar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspe...
متن کاملRestarting Automata and Variants of j-Monotonicity
In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without aux...
متن کاملHierarchies of weakly monotone restarting automata
It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
متن کاملCD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions
We introduce a new mode of operation for CD-systems of restarting automata by providing explicit enable and disable conditions in the form of regular constraints. We show that, for each CD-systemM of restarting automata and each mode m of operation considered by Messerschmidt and Otto, there exists a CD-systemM′ of restarting automata of the same type asM that, working in the new mode ed, accep...
متن کاملLookahead Hierarchies of Restarting Automata
The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.
متن کامل